Graphs with Minimum Vertex-Degree Function-Index for Convex Functions
نویسندگان
چکیده
منابع مشابه
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs
In this paper, two distributed algorithms for the minimum vertex cover problem are given. In the unweighted case, we propose a 2.5-approximation algorithm with round complexity O(∆), where ∆ is the maximal degree of G, improving the previous 3-approximation result with the same round complexity O(∆). For the weighted case, we give a 4-approximation algorithm with round complexity O(∆).
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملMinimum generalized degree distance of n-vertex tricyclic graphs
*Correspondence: [email protected] Department of Mathematics, Faculty of Mathematical Sciences, Tarbiat Modares University, P.O. Box 14115-137, Tehran, Iran Abstract In (Hamzeh et al. in Stud. Univ. Babeş-Bolyai, Chem., 4:73-85, 2012), we introduced a generalization of a degree distance of graphs as a new topological index. In this paper, we characterize the n-vertex tricyclic graphs whi...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملMinimum degree games for graphs
Given δ and n, a minimum degree game starts with n disconnected nodes. Two players alternate, each adding a new edge in turn, until the resulting graph has minimum degree at least δ. In the achievement game, the last player to move is the winner; in the avoidance game, the last to play is the loser. We determine a winning strategy for the avoidance game for every δ and n. The achievement game i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Match
سال: 2022
ISSN: ['0340-6253']
DOI: https://doi.org/10.46793/match.88-3.521h